Some surfaces with non-polyhedral nef cones
نویسندگان
چکیده
منابع مشابه
Some results of polyhedral cones and simplicial cones
This article may be used for research, teaching, and private study purposes. Any substantial or systematic reproduction, redistribution, reselling, loan, sub-licensing, systematic supply, or distribution in any form to anyone is expressly forbidden. The publisher does not give any warranty express or implied or make any representation that the contents will be complete or accurate or up to date...
متن کاملPolyhedral Combinatorics of UPGMA Cones
Distance-based methods such as UPGMA (Unweighted Pair Group Method with Arithmetic Mean) continue to play a significant role in phylogenetic research. We use polyhedral combinatorics to analyze the natural subdivision of the positive orthant induced by classifying the input vectors according to tree topologies returned by the algorithm. The partition lattice informs the study of UPGMA trees. We...
متن کاملBruhat Intervals and Polyhedral Cones
Lecture notes by Matthew Dyer for lectures at the workshop “Coxeter groups and convex geometry.” 1. Root labelled Bruhat graph 1.1. Bruhat order. Let (W,S) be a Coxeter group. Bruhat order is the partial order defined by the following proposition; see [3] and [13] for more details. Proposition. There is a partial order ≤ on W with the following properties. Let w ∈ W and w = s1 . . . sn, n = l0(...
متن کاملAn Algorithm for Finding All Extremal Rays of Polyhedral Convex Cones with Some Complementarity Conditions
In this paper, we show a method for finding all extremal rays of polyhedral convex cones with some complementarity conditions. The polyhedral convex cone is defined as the intersection of half-spaces expressed by linear inequalities. By a complementarity extremal ray, we mean an extremal ray vector that satisfies some complementarity conditions among its elen~nts. Our method is iterative in the...
متن کاملScalarizations for Maximization with Respect to Polyhedral Cones
Efficient points are obtained for cone-ordered maximizations in n R using the method of scalarization. Various scalarizations are presented for ordering cones in general and then for the important special case of polyhedral cones. For polyhedral cones, it is shown how to find vectors in the positive dual cone that are needed for a scalarized objective function. Instructive examples are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2018
ISSN: 0002-9939,1088-6826
DOI: 10.1090/proc/13296